The Decidability Frontier for Probabilistic Automata on Infinite Words
نویسندگان
چکیده
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.
منابع مشابه
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision p...
متن کاملInfinite Synchronizing Words for Probabilistic Automata (Erratum)
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the decidability result of [1,2,3] for the emptiness problem of weakly synchronizing language is incorrect.
متن کاملProbabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Probabilistic ω-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring that (i) the probability for the accepting runs is positive (probable semantics), or (ii) almost all runs are accepting (almost-sure semantics), or (iii) the probab...
متن کاملOn Büchi One-Counter Automata
Equivalence of deterministic pushdown automata is a famous problem in theoretical computer science whose decidability has been shown by Sénizergues. Our first result shows that decidability no longer holds when moving from finite words to infinite words. This solves an open problem that has recently been raised by Löding. In fact, we show that already the equivalence problem for deterministic B...
متن کاملThe Logical Strength of Büchi's Decidability Theorem
We study the strength of axioms needed to prove various results related to automata on infinite words and Büchi’s theorem on the decidability of the MSO theory of (N,≤). We prove that the following are equivalent over the weak second-order arithmetic theory RCA0: 1. Büchi’s complementation theorem for nondeterministic automata on infinite words, 2. the decidability of the depth-n fragment of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1104.0127 شماره
صفحات -
تاریخ انتشار 2011